A Complexity Bound on Faces of the Hull Complex

نویسنده

  • Mike Develin
چکیده

Given a monomial k[x1, . . . , xn]-module M in the Laurent polynomial ring k[x ±1 1 , . . . , x ±1 n ], the hull complex is defined to be the set of bounded faces of the convex hull of the points {t | x ∈ M} for sufficiently large t. Bayer and Sturmfels [2] conjectured that the faces of this polyhedron are of bounded complexity in the sense that every such face is affinely isomorphic to a subpolytope of the (n − 1)-dimensional permutohedron, which in particular would imply that these faces have at most n! vertices. In this paper, we prove that the latter statement is true, and give a counterexample to the stronger conjecture.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

On the Smoothed Complexity of Convex Hulls

We establish an upper bound on the smoothed complexity of convex hulls in R under uniform Euclidean (`2) noise. Specifically, let {p1, p2, . . . , pn} be an arbitrary set of n points in the unit ball in R and let pi = pi + xi, where x1, x2, . . . , xn are chosen independently from the unit ball of radius δ. We show that the expected complexity, measured as the number of faces of all dimensions,...

متن کامل

Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons

We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...

متن کامل

An Investigation into the Effects of Joint Planning on Complexity, Accuracy, and Fluency across Task Complexity

The current study aimed to examine the effects of strategic planning, online planning, strategic planning and online planning combined (joint planning), and no planning on the complexity, accuracy, and fluency of oral productions in two simple and complex narrative tasks. Eighty advanced EFL learners performed one simple narrative task and a complex narrative task with 20 minutes in between. Th...

متن کامل

Cognitive Task Complexity and Iranian EFL Learners’ Written Linguistic Performance across Writing Proficiency Levels

Recently tasks, as the basic units of syllabi, and the cognitive complexity, as the criterion for sequencing them, have caught many second language researchers’ attention. This study sought to explore the effect of utilizing the cognitively simple and complex tasks on high- and low-proficient EFL Iranian writers’ linguistic performance, i.e., fluency, accuracy, lexical complexity, and structura...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2004